An Optimal Multiplication Algorithm for Reconfigurable Mesh
نویسندگان
چکیده
An O(1) time algorithm to multiply two N-bit binary numbers using an N ¥ N bit-model of reconfigurable mesh is shown. It uses optimal mesh size and it improves previously known results for multiplication on the reconfigurable mesh. The result is obtained by using novel techniques for data representation and data movement and using multidimensional Rader Transform. The algorithm is extended to result in AT 2 optimality over 1 £ £ T N in a variant of the bit-model of VLSI.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملInteger and Floating Point Matrix-Vector Multiplication on the Reconfigurable Mesh
This paper presents the following results for matrixvector multiplication on the reconfigurable mesh (R-Mesh). Multiplication of an N N matrix and an N 1 vector (each element of which is an integer of w bits) can be performed in O(logw) time on a two-dimensional O N w logw log N O N w logw log N R-Mesh or a three-
متن کاملBit Model Based Key Management Scheme for Secure Group Communication
For the last decade, researchers have started to focus their interest on Multicast Group Key Management Framework. The central research challenge is secure and efficient group key distribution. The present paper is based on the Bit model based Secure Multicast Group key distribution scheme using the most popular absolute encoder output type code named Gray Code. The focus is of two folds. The f...
متن کاملAn O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes
It was open for more than eight years to obtain an algorithm for computing the convex hull of a set of n sorted points in sub-logarithmic time on a reconfigurable mesh of size p n pn. Our main contribution is to provide the first breakthrough: we propose an almost optimal algorithm running in O((log logn)2) time on a reconfigurable mesh of size p n pn. With slight modifications this algorithm c...
متن کاملOptimal Simulations in Reconfigurable Arrays
There are several reconfiguring models of parallel computation that are considered in the published literature, depending on their switching capabilities. Three of the more popular ones are the Horizontal-Vertical Reconfigurable Mesh (HV-RN model) [LM89a, LM89b, ML89], the Linear Reconfigurable Mesh (LRN model) [MPRS87, BPRS91], and the General Reconfigurable Mesh (RN model) [Wan91, Sch91]. Can...
متن کامل